Multi-criteria ACO-based Algorithm for Ship’s Trajectory Planning
نویسندگان
چکیده
منابع مشابه
MGA trajectory planning with an ACO-inspired algorithm
Given a set of celestial bodies, the problem of finding an optimal sequence of swing-bys, deep space manoeuvres (DSM) and transfer arcs connecting the elements of the set is combinatorial in nature. The number of possible paths grows exponentially with the number of celestial bodies. Therefore, the design of an optimal multiple gravity assist (MGA) trajectory is a NP-hard mixed combinatorial-co...
متن کاملMulti-criteria Trajectory Planning for Hepatic Radiofrequency Ablation
In this paper, we propose a method based on multiple criteria to assist physicians in planning percutaneous RFA on liver. We explain how we extracted information from literature and interviews with radiologists, and formalized them into geometric constraints. We expose then our method to compute the most suitable needle insertion in two steps: computation of authorized insertion zones and multi...
متن کاملSolving Multi-criteria Optimization Problems with Population-Based ACO
In this paper a Population-based Ant Colony Optimization approach is proposed to solve multi-criteria optimization problems where the population of solutions is chosen from the set of all non-dominated solutions found so far. We investigate different maximum sizes for this population. The algorithm employs one pheromone matrix for each type of optimization criterion. The matrices are derived fr...
متن کاملA message-passing algorithm for multi-agent trajectory planning
We describe a novel approach for computing collision-free global trajectories for p agents with specified initial and final configurations, based on an improved version of the alternating direction method of multipliers (ADMM). Compared with existing methods, our approach is naturally parallelizable and allows for incorporating different cost functionals with only minor adjustments. We apply ou...
متن کاملPareto-based Multi-criteria Evolutionary Algorithm for Parallel Machines Scheduling Problem with Sequence-dependent Setup Times
This paper addresses an unrelated multi-machine scheduling problem with sequence-dependent setup time, release date and processing set restriction to minimize the sum of weighted earliness/tardiness penalties and the sum of completion times, which is known to be NP-hard. A Mixed Integer Programming (MIP) model is proposed to formulate the considered multi-criteria problem. Also, to solve the mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TransNav, the International Journal on Marine Navigation and Safety of Sea Transportation
سال: 2017
ISSN: 2083-6473
DOI: 10.12716/1001.11.01.02